Hub-Authority Cores and Attributed Directed Network Mining
نویسندگان
چکیده
We first define and experiment the hub-authority core (or HA-core) of a directed network. It depends on two a and h parameters expressing requirements on hub and authority degrees which have to be fulfilled within the core. The definition of these interrelated degrees is inspired by the standard definition of hub and authorities centrality scores (HITS). We investigate the HA-cores on citation networks and discuss how they relates to these scores. We discuss then how the methodology of abstract closed pattern mining, previously defined on non-directed attributed networks, may be applied to directed networks using hub-authority cores. We use these cores to investigate a well known attributed network representing the advice exchanges within a law firm.
منابع مشابه
HAR: Hub, Authority and Relevance Scores in Multi-Relational Data for Query Search | Proceedings of the 2012 SIAM International Conference on Data Mining | Society for Industrial and Applied Mathematics
In this paper, we propose a framework HAR to study the hub and authority scores of objects, and the relevance scores of relations in multi-relational data for query search. The basic idea of our framework is to consider a random walk in multi-relational data, and study in such random walk, limiting probabilities of relations for relevance scores, and of objects for hub scores and authority scor...
متن کاملHubs and Authorities in the World Trade Network Using a Weighted HITS Algorithm
We investigate the economic hubs and authorities of the world trade network (WTN) from 1992 to 2012, an era of rapid economic globalization. Using a well-defined weighted hyperlink-induced topic search (HITS) algorithm, we can calculate the values of the weighted HITS hub and authority for each country in a conjugate way. In the context of the WTN, authority values are large for countries with ...
متن کاملRanking hubs and authorities using matrix functions
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of undirected networks. In this paper we propose an extension of these measures to directed networks, and we apply them to the problem of ranking hubs and authorities. The extension is achieved by bipartization, i.e., the di...
متن کاملMathematical genealogy and department prestige.
The Mathematics Genealogy Project (http://www. genealogy.ams.org/) is a database of over 150 000 scholars with advanced degrees in mathematics and related fields. Entries include dissertation titles, adviser(s), graduation years, degree-granting institutions, and advisees. The MGP is popular among mathematicians, and it can be used to trace academic lineages through luminaries like Courant, Hil...
متن کاملHIPRank: Ranking Nodes by Influence Propagation Based on Authority and Hub
Traditional centrality measures such as degree, betweenness, closeness and eigenvector ignore the intrinsic impacts of a node on other nodes. This paper proposes a new algorithm, called HIPRank, to rank nodes based on their influences in the network. HIPRank includes two sub-procedures: one is to predefine the importance of an arbitrary small number of nodes with users’ preferences, and the oth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017